-
1 nearest neighbor algorithm
Математика: алгоритм ближайшего соседаУниверсальный англо-русский словарь > nearest neighbor algorithm
-
2 nearest neighbor algorithm
матем.English-Russian scientific dictionary > nearest neighbor algorithm
-
3 algorithm
nounалгоритм mdivide-and-conquer algorithm алгоритм "разделяй и властвуй"farthest neighbor algorithm алгоритм "дальнего соседа"nearest neighbor algorithm алгоритм "ближайшего соседа"Английский-русский словарь по теории вероятностей, статистике и комбинаторике > algorithm
-
4 algorithm
-
5 KNN algorithm
См. также в других словарях:
k-nearest neighbor algorithm — KNN redirects here. For other uses, see KNN (disambiguation). In pattern recognition, the k nearest neighbor algorithm (k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance… … Wikipedia
K-nearest neighbor algorithm — In pattern recognition, the k nearest neighbor algorithm ( k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance based learning, or lazy learning where the function is only… … Wikipedia
Nearest neighbour algorithm — This article is about an approximation algorithm to solve the travelling salesman problem. For other uses, see Nearest neighbor. The nearest neighbour algorithm was one of the first algorithms used to determine a solution to the travelling… … Wikipedia
Nearest neighbor search — (NNS), also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric spaces. The problem is: given a set S of points in a metric space M and a query point… … Wikipedia
Nearest neighbor — may refer to: Nearest neighbor search in pattern recognition and in computational geometry Nearest neighbor interpolation for interpolating data Nearest neighbor graph in geometry The k nearest neighbor algorithm in machine learning, an… … Wikipedia
Nearest-neighbor interpolation — (blue lines) in one dimension on a (uniform) dataset (red points) … Wikipedia
Nearest-neighbor chain algorithm — In the theory of cluster analysis, the nearest neighbor chain algorithm is a method that can be used to perform several types of agglomerative hierarchical clustering, using an amount of memory that is linear in the number of points to be… … Wikipedia
Nearest neighbor graph — A nearest neighbor graph of 100 points in the Euclidean plane. The nearest neighbor graph (NNG) for a set of n objects P in a metric space (e.g., for a set of points in the plane with Euclidean distance) is a directed graph with P being its… … Wikipedia
Greedy algorithm — A greedy algorithm is any algorithm that follows the problem solving metaheuristic of making the locally optimum choice at each stage Paul E. Black, greedy algorithm in Dictionary of Algorithms and Data Structures [online] , U.S. National… … Wikipedia
Ibk algorithm — The ibk algorithm is an alternate version of the k nearest neighbor algorithm, used in k nearest neighbour classification … Wikipedia
FNN algorithm — The false nearest neighbor (FNN) algorithm is an algorithm for estimating the embedding dimension.ee also* Time series * Nearest neighbor External links * [http://balrog.wku.edu/ amaral/docs/chaospaper/node9.html False nearest neighbors] by… … Wikipedia
